Randomized algorithms

Results: 419



#Item
41Chapter 1 Online Scheduling Susanne Albers University of Freiburg, Germany

Chapter 1 Online Scheduling Susanne Albers University of Freiburg, Germany

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 10:58:01
42On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology Mordechai Shalom1 ? , Prudence W.H. Wong  ??2

On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology Mordechai Shalom1 ? , Prudence W.H. Wong ??2

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2009-06-10 05:42:48
43On Generalized Connection Caching Susanne Albers Abstract Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where

On Generalized Connection Caching Susanne Albers Abstract Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:04:47
44Mathemati
al Programming manus
ript No.  (will be inserted by the editor) Susanne Albers Online Algorithms: A Survey

Mathemati al Programming manus ript No. (will be inserted by the editor) Susanne Albers Online Algorithms: A Survey

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:03:55
45Distributed Computation of the Mode Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich

Distributed Computation of the Mode Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:27
46Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2005-11-30 21:17:11
47Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany  arXiv:0910.2582v1 [cs.DS] 14 Oct 2009

Scalable Distributed-Memory External Sorting Mirko Rahn, Peter Sanders, Johannes Singler4 Karlsruhe Institute of Technology Postfach 6980, 76128 Karlsruhe, Germany arXiv:0910.2582v1 [cs.DS] 14 Oct 2009

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2009-10-14 08:51:26
48Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland

Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:23
49Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING, ETH Z¨ urich

Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING, ETH Z¨ urich

Add to Reading List

Source URL: paulduetting.com

Language: English - Date: 2015-12-11 02:28:02
50Fault Tolerant External Memory Algorithms Gerth Stølting Brodal1 , Allan Grønlund Jørgensen1,? , and Thomas Mølhave1,? BRICS, MADALGO?? , Department of Computer Science, Aarhus University, Denmark. {gerth,jallan,thom

Fault Tolerant External Memory Algorithms Gerth Stølting Brodal1 , Allan Grønlund Jørgensen1,? , and Thomas Mølhave1,? BRICS, MADALGO?? , Department of Computer Science, Aarhus University, Denmark. {gerth,jallan,thom

Add to Reading List

Source URL: users.cs.duke.edu

Language: English - Date: 2015-07-24 06:57:56